A Dynamic Maintenance Strategy for Multi-Component Systems Using a Genetic Algorithm

نویسندگان

چکیده

In multi-component systems, the components are dependent, rather than degenerating independently, leading to changes in maintenance schedules. this situation, study proposes a grouping dynamic strategy. Considering structure of strategy is determined according importance components. The can minimize expected depreciation cost system and divide into optimal groups that meet economic requirements. First, models grouped. Then, failure probability model systems established. parameters each cycle updated Second, component indicator introduced model, optimization which aimed at maximum profit, A genetic algorithm used solve non-deterministic polynomial (NP)-complete problem obtained through initial by random allocation. An 11-component series parallel illustrate effectiveness proposed strategy, influence on discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maintenance grouping strategy for multi-component systems with dynamic contexts

This paper presents a dynamic maintenance grouping strategy for multi-component systems with both “positive” and “negative” economic dependencies. Positive dependencies are commonly due to setup cost whereas negative dependencies are related to shutdown cost. Actually, grouping maintenance activities can save part of the setup cost, but can also in the same time increase the shutdown cost. Unti...

متن کامل

A dynamic predictive maintenance policy for complex multi-component systems

The use of prognostic methods in maintenance in order to predict remaining useful life is receiving more attention over the past years. The use of these techniques in maintenance decision making and optimization in multi-component systems is however a still underexplored area. The objective of this paper is to optimally plan maintenance for a multi-component system based on prognostic/predictiv...

متن کامل

A genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem

Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one o...

متن کامل

Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...

متن کامل

A genetic algorithm approach for a dynamic cell formation problem considering machine breakdown and buffer storage

Cell formation problem mainly address how machines should be grouped and parts be processed in cells. In dynamic environments, product mix and demand change in each period of the planning horizon. Incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. In this model, to ensure the reliability of the system in presence of unreliable machine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cmes-computer Modeling in Engineering & Sciences

سال: 2023

ISSN: ['1526-1492', '1526-1506']

DOI: https://doi.org/10.32604/cmes.2022.022444